Edema Extension Distance

Edema Extension Distance: Outcome Measure for Phase II Clinical Trials Targeting Edema After Intracerebral Hemorrhage.

On an extension of distance hereditary graphs

Given a simple and finite connected graph G, the distance dG(u, v) is the length of the shortest induced {u, v}-path linking the vertices u and v in G. Bandelt and Mulder [H.J. Bandelt, H.M. Mulder, Distance hereditary graphs, J. Combin. Theory Ser. B 41 (1986) 182–208] have characterized the class of distance hereditary graphs where the distance is preserved in each connected induced subgraph....

The Johnson Graphs Satisfy a Distance Extension Property

A graph G has property I k if whenever F and H are connected graphs with jFj k and jHj = jFj+1, and i : F ! G and j : F ! H are isometric embeddings, then there is an isometric embedding k : H ! G such that k j = i. It is easy to construct an innnite graph with I k for all k, and I 2 holds in almost all nite graphs. Prior to this work, it was not known whether there exist any nite graphs with I...

A Distance Property of the Feuerbach Point and Its Extension

We prove that among the distances from the inner Feuerbach point of a triangle to the midpoints of the three sides, one is equal to the sum of the remaining two. The same is true if the inner Feuerbach point is replaced by any one of the outer Feuerbach points.

Towards a Fuzzy Extension of the López de Mántaras Distance

In this paper we introduce FLM, a divergence measure to compare a fuzzy and a crisp partition. This measure is an extension of LM, the López de Mántaras distance. This extension allows to handle domain objects having attributes with continuous values. This means that for some domains the use of fuzzy sets may report better results than the discretization that is the usual way to deal with conti...